Truth Values and Connectives in Some Non-Classical Logics
نویسندگان
چکیده مقاله:
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (many) valued. Now we know that the propositional intuitionistic logic is infinitely many valued (with a countably many logical values). In this paper we provide another proof for this result of Gödel, from the perspective of Kripke model theory. Švejadr and Bendova (2000) proved that in Gödel fuzzy logic the conjunction and implication are not definable by the rest of the propositional connectives (while disjunction is definable by conjunction and implication). In this paper, we show that disjunction is not definable by implication and negation in Gödel fuzzy logic; two proofs, one by Kripke models and one by fuzzy semantics, are provided for this new theorem.
منابع مشابه
Fuzzy Descriptions Logics with Fuzzy Truth Values
Fuzzy Description Logics are a family of logics which allow to deal with structured knowledge affected by vagueness. Although a relatively important amount of work has been carried out in the last years, current fuzzy DLs are open to be extend with several features worked out in the fuzzy logic literature. In this work, we extend fuzzy DLs with fuzzy truth values, allowing to state sentences su...
متن کاملProof search issues in some non-classical logics
This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some non-classical logics. Gentzen sys...
متن کاملNon-classical Metatheory for Non-classical Logics
A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical meta-theory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena o...
متن کاملConnectives in Cumulative Logics
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson’s [11] early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of Sen’s property α, in the spirit of the author’s [9]. The representation results obtained are surprisingly smooth: in the completeness part the choice fu...
متن کاملGame theoretical semantics for some non-classical logics
Paraconsistent logics are the formal systems in which absurdities do not trivialise the logic. In this paper, we give Hintikka-style game theoretical semantics for a variety of paraconsistent and non-classical logics. For this purpose, we consider Priest’s Logic of Paradox, Dunn’s First-Degree Entailment, Routleys’ Relevant Logics, McCall’s Connexive Logic and Belnap’s four-valued logic. We als...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 5 شماره 19
صفحات 31- 36
تاریخ انتشار 2019-08-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023